Search results for "Ehrhart polynomial"

showing 1 items of 1 documents

The Linear Ordering Polytope

2010

So far we developed a general integer programming approach for solving the LOP. It was based on the canonical IP formulation with equations and 3-dicycle inequalities which was then strengthened by generating mod-k-inequalities as cutting planes. In this chapter we will add further ingredients by looking for problem- specific inequalities. To this end we will study the convex hull of feasible solutions of the LOP: the so-called linear ordering polytope.

CombinatoricsConvex hullLinear programmingBirkhoff polytopeComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONConvex polytopeCross-polytopeMathematicsofComputing_NUMERICALANALYSISUniform k 21 polytopeEhrhart polynomialVertex enumeration problemMathematics
researchProduct